Labeling a rectilinear map more efficiently

Labeling a Rectilinear Map More Efficiently

Given a rectilinear map consisting of n disjoint line segments, the corresponding labeling problem is to place a rectangle at each segment, allowing three possible positions, such that the rectangles do not intersect. This problem has a decision and a height maximization version. This paper improves results from Poon, Zhu and Chin: A polynomial time solution for labeling a rectilinear map (IPL ...

Labeling a Rectilinear Map More Eeciently

Given a rectilinear map consisting of n disjoint line segments, the corresponding labeling problem is to place a rectangle at each segment, allowing three possible positions, such that the rectangles do not intersect. This problem has a decision and a height maximization version. This paper improves results from Poon, Zhu and Chin: A polynomial time solution for labeling a rectilinear map (IPL ...

Labeling a Rectilinear Map More E ciently

Given a rectilinear map consisting of n disjoint line segments, the corresponding labeling problem is to place a rectangle at each segment, allowing three possible positions, such that the rectangles do not intersect. This problem has a decision and a height maximization version. This paper improves results from Poon, Zhu and Chin: A polynomial time solution for labeling a rectilinear map (IPL ...

U ST - T C SC - 9 9 - 06 Labeling a rectilinear map with sliding labelsSung

Cellular Automata to More Efficiently Compute the Collatz Map

The Collatz, or 3x+ 1, Conjecture claims that for every positive integer n, there exists some k such that T (n) = 1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the Collatz map in bases 2, 3, and 4 into a local one of transforming the digits of iterates. The CAs streamline computation first by bypassing calculation of certai...